Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, f(a, y)) → f(f(y, f(f(a, a), a)), x)

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, f(a, y)) → f(f(y, f(f(a, a), a)), x)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F(x, f(a, y)) → F(f(a, a), a)
F(x, f(a, y)) → F(a, a)
F(x, f(a, y)) → F(f(y, f(f(a, a), a)), x)
F(x, f(a, y)) → F(y, f(f(a, a), a))

The TRS R consists of the following rules:

f(x, f(a, y)) → f(f(y, f(f(a, a), a)), x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

F(x, f(a, y)) → F(f(a, a), a)
F(x, f(a, y)) → F(a, a)
F(x, f(a, y)) → F(f(y, f(f(a, a), a)), x)
F(x, f(a, y)) → F(y, f(f(a, a), a))

The TRS R consists of the following rules:

f(x, f(a, y)) → f(f(y, f(f(a, a), a)), x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F(x, f(a, y)) → F(f(a, a), a)
F(x, f(a, y)) → F(a, a)
F(x, f(a, y)) → F(f(y, f(f(a, a), a)), x)
F(x, f(a, y)) → F(y, f(f(a, a), a))

The TRS R consists of the following rules:

f(x, f(a, y)) → f(f(y, f(f(a, a), a)), x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 3 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F(x, f(a, y)) → F(f(y, f(f(a, a), a)), x)

The TRS R consists of the following rules:

f(x, f(a, y)) → f(f(y, f(f(a, a), a)), x)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.